Testing whether a digraph contains H-free k-induced subgraphs
نویسندگان
چکیده
منابع مشابه
Maximum k -regular induced subgraphs
Independent sets, induced matchings and cliques are examples of regular induced subgraphs in a graph. In this paper, we prove that finding a maximum cardinality k-regular induced subgraph is an NP-hard problem for any value of k. We propose a convex quadratic upper bound on the size of a k-regular induced subgraph and characterize those graphs for which this bound is attained. Finally, we exten...
متن کاملOn K-free Subgraphs of Random Graphs
For 0 < γ ≤ 1 and graphs G and H, write G→γ H if any γ-proportion of the edges of G span at least one copy of H in G. As customary, write Kr for the complete graph on r vertices. We show that for every fixed real η > 0 there exists a constant C = C(η) such that almost every random graph Gn,p with p = p(n) ≥ Cn−2/5 satisfies Gn,p →2/3+η K4. The proof makes use of a variant of Szemerédi’s regular...
متن کاملOn small subgraphs in a random intersection digraph
Given a set of vertices V and a set of attributes W let each vertex v ∈ V include an attribute w ∈W into a set S−(v) with probability p− and let it include w into a set S(v) with probability p+ independently for each w ∈ W . The random binomial intersection digraph on the vertex set V is defined as follows: for each u, v ∈ V the arc uv is present if S−(u) and S(v) are not disjoint. For any h = ...
متن کاملForbidden induced subgraphs for star-free graphs
Let H be a family of connected graphs. A graph G is said to be H-free if G is H-free for every graph H in H. In [1] it was pointed that there is a family of connected graphs H not containing any induced subgraph of the claw having the property that the set of H-free connected graphs containing a claw is finite, provided also that those graphs have minimum degree at least two and maximum degree ...
متن کاملMany cliques in H-free subgraphs of random graphs
For two fixed graphs T and H let ex(G(n, p), T,H) be the random variable counting the maximum number of copies of T in an H-free subgraph of the random graph G(n, p). We show that for the case T = Km and χ(H) > m the behavior of ex(G(n, p),Km, H) depends strongly on the relation between p and m2(H) = maxH′⊆H,|V (H′)|′≥3 { e(H′)−1 v(H′)−2 } . When m2(H) > m2(Km) we prove that with high probabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.08.033